Construction of normal numbers via pseudo-polynomial prime sequences

نویسندگان

  • Manfred G. Madritsch
  • MANFRED G. MADRITSCH
  • M. G. MADRITSCH
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction of Normal Numbers via Generalized Prime Power Sequences

We construct normal numbers in base q by concatenating q-adic expansions of prime powers αp θ with α > 0 and θ > 1.

متن کامل

Polynomial pseudo-noise sequences based on algebraic feedback shift registers

We apply the framework of algebraic feedback shift registers to polynomial rings over finite fields. This gives a construction of new pseudorandom sequences (over non-prime finite fields), which satisfy Golomb’s three randomness criteria.

متن کامل

Iterated constructions of irreducible polynomials over finite fields with linearly independent roots

The paper is devoted to constructive theory of synthesis of irreducible polynomials and irreducible N-polynomials (with linearly independent roots) over finite fields. For a suitably chosen initial N-polynomial F1ðxÞAF2s 1⁄2x of degree n; polynomials FkðxÞAF2s 1⁄2x of degrees 2 n are constructed by iteration of the transformation of variable x-x þ dx ; where dAF2s and da0: It is shown that the ...

متن کامل

A DHT Based Measure of Randomness

This paper presents a new discrete Hilbert transform (DHT) based measure of randomness for discrete sequences. The measure has been used to test three different classes of sequences with satisfactory results. Introduction Random numbers are used in different fields as in cryptography for generating encryption keys, in simulating and modeling complex phenomena and for selecting random samples fr...

متن کامل

Parallel Construction of Irreducible Polynomials

Let arithmetic pseudo-NCk denote the problems that can be solved by log space uniform arithmetic circuits over the finite prime field Fp of depth O(log(n + p)) and size (n + p)O(1). We show that the problem of constructing an irreducible polynomial of specified degree over Fp belongs to pseudo-NC2.5. We prove that the problem of constructing an irreducible polynomial of specified degree over Fp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016